Frequent Directions: Simple and Deterministic Matrix Sketching
نویسندگان
چکیده
We describe a new algorithm called Frequent Directions for deterministic matrix sketching in the row-updates model. The algorithm is presented an arbitrary input matrix A ∈ Rn×d one row at a time. It performed O(d`) operations per row and maintains a sketch matrix B ∈ R`×d such that for any k < ` ‖AA−BB‖2 ≤ ‖A−Ak‖F /(`− k) and ‖A− πBk(A)‖F ≤ ( 1 + k `− k ) ‖A−Ak‖F . Here, Ak stands for the minimizer of ‖A−Ak‖F over all rank k matrices (similarly Bk) and πBk(A) is the rank k matrix resulting from projecting A on the row span of Bk. We show both of these bounds are the best possible for the space allowed. The summary is mergeable, and hence trivially parallelizable. Moreover, Frequent Directions outperforms exemplar implementations of existing streaming algorithms in the space-error tradeoff.2
منابع مشابه
Co-Occurring Directions Sketching for Approximate Matrix Multiply
We introduce co-occurring directions sketching, a deterministic algorithm for approximate matrix product (AMM), in the streaming model. We show that co-occurring directions achieves a better error bound for AMM than other randomized and deterministic approaches for AMM. Co-occurring directions gives a (1 + ")-approximation of the optimal low rank approximation of a matrix product. Empirically o...
متن کاملCo-Occuring Directions Sketching for Approximate Matrix Multiply
We introduce co-occurring directions sketching, a deterministic algorithm for approximate matrix product (AMM), in the streaming model. We show that co-occuring directions achieves a better error bound for AMM than other randomized and deterministic approaches for AMM. Co-occurring directions gives a (1 + ε)-approximation of the optimal low rank approximation of a matrix product. Empirically ou...
متن کاملFrequent Directions for Matrix Sketching with Provable Bounds: A Generalized Approach
ABSTRACT We consider the task of matrix sketching, which is obtaining a significantly smaller representation of matrix A while retaining most of its information (or in other words, approximates A well). In particular, we investigate a recent approach called Frequent Directions (FD) initially proposed by Liberty [5] in 2013, which has drawn wide attention due to its elegancy, nice theoretical gu...
متن کاملFrequent Direction Algorithms for Approximate Matrix Multiplication with Applications in CCA
Approximate matrix multiplication (AMM) becomes increasingly popular because it makes matrix computation suitable for large-scale datasets. Most previous AMM methods are based on the idea of random selection or random projection. In this paper, we propose a deterministic algorithm FD-AMM for computing an approximation to the product of two given matrices. Moreover, the algorithm works in a stre...
متن کاملFaster Anomaly Detection via Matrix Sketching
We present efficient streaming algorithms to compute two commonly used anomaly measures: the rank-k leverage scores (aka Mahalanobis distance) and the rank-k projection distance, in the rowstreaming model. We show that commonly used matrix sketching techniques such as the Frequent Directions sketch and random projections can be used to approximate these measures. Our main technical contribution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 45 شماره
صفحات -
تاریخ انتشار 2016